Lower Bounds for Threshold Circuits of Bounded Energy
نویسندگان
چکیده
منابع مشابه
Algorithms and Lower Bounds for Threshold Circuits
A fundamental purpose of theory of computation is to understand differences between uniform computation and nonuniform one. In particular, Boolean circuit has been studied in an area of nonuniform computation models, because Boolean circuits are natural formalization of computer architecture and hardware. Boolean circuit is compared with uniform computation expressed as fixed size programs whic...
متن کاملLower bounds on threshold and related circuits via communication complexity
Communication-complexity definitions and arguments are used to derive linear (Q(n)) and almost-linear (Q(n/ log n)) lower bounds on the size of circuits implementing certain functions. The techniques utilize only basic features of the gates used and of the functions implemented hence apply to a large class of gates (including unbounded fan-in AND/OR, threshold, symmetric, and generalized symmet...
متن کاملLower Bounds for the Size of Circuits of Bounded Depth in Basis F^; G
Preface The following is a translation of the preprint concerning the recent majority result by Razborov (to appear in Matematicheskie Zametki). It is my intent in this endeavor to be faithful to the original Russian text while illuminating details as required. Any additions that I make will be set oo in indented paragraphs and presented in a smaller type font. For example, This is an explicati...
متن کاملLower Bounds for Non-Commutative Skew Circuits
Nisan (STOC 1991) exhibited a polynomial which is computable by linear-size non-commutative circuits but requires exponential-size non-commutative algebraic branching programs. Nisan’s hard polynomial is in fact computable by linear-size “skew circuits.” Skew circuits are circuits where every multiplication gate has the property that all but one of its children is an input variable or a scalar....
متن کاملBetter Lower Bounds for Monotone Threshold Formulas
We show that every monotone formula that computes the threshold function THk,n, 2 ≤ k ≤ n2 , has size at least ⌊ k 2 ⌋ n log( n k−1 ). The same lower bound is shown to hold in the stronger monotone directed contact networks model.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 2014
ISSN: 1340-9050,1347-6157
DOI: 10.4036/iis.2014.27